Integer Partitions and Binary Trees
نویسندگان
چکیده
منابع مشابه
Non-Crossing Partitions in Binary, Ordered and Motzkin Trees
Non-Crossing Tree partitions are newer mathematical objects that have recent applications in genetics and mathematical biology. We explore several interesting connections between these partitions and the more commonly studied non-crossing set partitions. While non-crossing set partitions are counted by the Catalan numbers, we prove that non-crossing tree partitions in Binary trees are counted b...
متن کاملBinary partitions of integers and Stern-Brocot-like trees
We study partitions of an integer n in which all parts are powers of 2, no power of 2 appearing more than twice. If b(n) is the number of these, and B(n) = P j n b(j), then we nd (a) that gcd (b(n); b(n+ 1)) = 1, and that every coprime (i; j) occurs exactly once as a pair of consecutive values (b) the asymptotic behavior of B(t2), for xed 1 < t < 2, as n!1 (c) descriptions of b(n) in terms of t...
متن کاملInteger Partitions
Let denote the positive octant of the regular -dimensional cubic lattice. Each vertex (1 2 ) of is adjacent to all vertices of the form (1 2 + 1 ), 1 ≤ ≤ . A -partition of a positive integer is an assignment of nonnegative integers 12 to the vertices of , subject to both an ordering condition 12 ≥ max 1≤≤ 12+...
متن کاملInteger Partitions and Convexity
Let n be an integer ≥ 1, and let p(n, k) and P (n, k) count the number of partitions of n into k parts, and the number of partitions of n into parts less than or equal to k, respectively. In this paper, we show that these functions are convex. The result includes the actual value of the constant of Bateman and Erdős.
متن کاملIsoperimetric Sequences for Infinite Complete Binary Trees, Meta-Fibonacci Sequences and Signed Almost Binary Partitions
In this paper we demonstrate connections between three seemingly unrelated concepts. 1. The discrete isoperimetric problem in the infinite binary tree with all the leaves at the same level, T∞: The n-th edge isoperimetric number δ(n) is defined to be min|S|=n,S⊂V (T∞) |(S, S)|, where (S, S) is the set of edges in the cut defined by S. 2. Signed almost binary partitions: This is the special case...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2002
ISSN: 0196-8858
DOI: 10.1006/aama.2001.0797